Visual Tracking via Sparse and Local Linear Coding
نویسندگان
چکیده
منابع مشابه
3D Visual Comfort Assessment via Sparse Coding
The issue of visual discomfort has long been restricting the develop‐ ment of advanced stereoscopic 3D video technology. Bolstered by the require‐ ment of highly comfortable three-dimensional (3D) content service, predicting the degree of visual comfort automatically with high accuracy has become a topic of intense study. This paper presents a novel visual comfort assessment (VCA) metric based ...
متن کاملVisual Tracking Using Sparse Coding and Earth Mover's Distance
An efficient iterative Earth Mover’s Distance (iEMD) algorithm for visual tracking is proposed in this paper. The Earth Mover’s Distance (EMD) is used as the similarity measure to search for the optimal template candidates in feature-spatial space in a video sequence. The computation of the EMD is formulated as the transportation problem from linear programming. The efficiency of the EMD optimi...
متن کاملSparse coding based visual tracking: Review and experimental comparison
Recently, sparse coding has been successfully applied in visual tracking. The goal of this paper is to review the state-of-the-art tracking methods based on sparse coding. We first analyze the benefits of using sparse coding in visual tracking and then categorize these methods into appearance modeling based on sparse coding (AMSC) and target searching based on sparse representation (TSSR) as we...
متن کاملSparse Coding and Counting for Robust Visual Tracking
In this paper, we propose a novel sparse coding and counting method under Bayesian framework for visual tracking. In contrast to existing methods, the proposed method employs the combination of L0 and L1 norm to regularize the linear coefficients of incrementally updated linear basis. The sparsity constraint enables the tracker to effectively handle difficult challenges, such as occlusion or im...
متن کاملSparse Coding via Thresholding and Local Competition in Neural Circuits
While evidence indicates that neural systems may be employing sparse approximations to represent sensed stimuli, the mechanisms underlying this ability are not understood. We describe a locally competitive algorithm (LCA) that solves a collection of sparse coding principles minimizing a weighted combination of mean-squared error and a coefficient cost function. LCAs are designed to be implement...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Image Processing
سال: 2015
ISSN: 1057-7149,1941-0042
DOI: 10.1109/tip.2015.2445291